Statistical Alignment via k-Restricted Steiner Trees
نویسنده
چکیده
When relating a set of sequences by a phylogeny, we are essentially constructing a Steiner tree connecting the sequences in the space of all finite sequences. Finding an optimal Steiner tree is in most formulations hard, so population genetics and phylogenetics have often used spanning trees as an approximation for computational expediency. In this assessment you will be asked to investigate an intermediate between spanning trees and Steiner trees.
منابع مشابه
Geometric conditions for Euclidean Steiner trees in ℜd
We present geometric conditions that can be used to restrict or eliminate candidate topologes for Euclidean Steiner minimal trees in , d ≥ 2. Our emphasis is on conditions that are not restricted to the planar case (d = 2). For trees with a Steiner topology we give restrictions on terminal-Steiner connections that are based on the Voronoi diagram associated with the set of terminal nodes. We th...
متن کاملA New Algorithm for the Euclidean k-Bottleneck Steiner Problem
We consider the problem of adding a fixed number of relays to a WSN in order to minimise the length of the longest transmission edge. Since routing subnetworks are often trees we model the problem as a Euclidean k-bottleneck Steiner tree problem (k-BSTP). We then propose a new iterative approximation algorithm for the k-BSTP, based on an exact solution to the 1-BSTP, and compare our heuristic (...
متن کاملAttacking Generalized Tree Alignment
Many multiple alignment methods implicitly or explicitly try to minimize the amount of biological change implied by an alignment. At the level of sequences, biological change is measured along a phylogenetic tree, a structure frequently being predicted only after the multiple alignment instead of together with it. The Generalized Tree Alignment problem addresses both questions simultaneously. I...
متن کاملApproximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [15] discovered primal-dual approximation algorithms for the metric uncapacitated facility location and k-median problems. In this paper we show how Garg’s algorithms can be explained simply with ideas introduced by Jain and Vazirani, in particular via a ...
متن کاملThe k-th Total Path Length and the Total Steiner k-Distance for Digital Search Trees
The total Steiner k-distance and the k-th total path length are the sum of the size of Steiner trees and ancestor-trees over sets of k nodes of a given tree, respectively. They are useful statistics with many applications. Consequently, they have been analyzed for many different random trees, including increasing tree, binary search tree, generalized m-ary search tree and simply generated trees...
متن کامل